The Maximum Hamilton Path Problem with Parameterized Triangle Inequality
نویسندگان
چکیده
منابع مشابه
Parameterized Maximum Path Coloring
We study the well-known Max Path Coloring problem from a parameterized point of view, focusing on trees and low-treewidth networks. We observe the existence of a variety of reasonable parameters for the problem, such as the maximum degree and treewidth of the network graph, the number of available colors and the number of requests one seeks to satisfy or reject. In an effort to understand the i...
متن کاملPerformance Guarantees for the TSP with a Parameterized Triangle Inequality
We consider the approximability of the tsp problem in graphs that satisfy a relaxed form of triangle inequality. More precisely, we assume that for some parameter 1, the distances satisfy the inequality dist(x; y) (dist(x; z) + dist(z; y)) for every triple of vertices x, y, and z. We obtain a 4 approximation and also show that for some > 0 it is np-hard to obtain a (1 +) approximation. Our uppe...
متن کاملOn the metric triangle inequality
A non-contradictible axiomatic theory is constructed under the local reversibility of the metric triangle inequality. The obtained notion includes the metric spaces as particular cases and the generated metric topology is T$_{1}$-separated and generally, non-Hausdorff.
متن کاملThe Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
In this paper, we deal with several reoptimization variants of the Steiner tree problem in graphs obeying a sharpened β-triangle inequality. A reoptimization algorithm exploits the knowledge of an optimal solution to a problem instance for finding good solutions for a locally modified instance. We show that, in graphs satisfying a sharpened triangle inequality (and even in graphs where edge-cos...
متن کاملAn improved approximation algorithm for the ATSP with parameterized triangle inequality
Article history: Received 10 April 2008 Available online 21 October 2008
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications and Network
سال: 2013
ISSN: 1949-2421,1947-3826
DOI: 10.4236/cn.2013.51b022